State matrix recursion method and monomer–dimer problem
نویسندگان
چکیده
منابع مشابه
Efficient Recursion Method for Inverting Overlap Matrix
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N , is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations with the the non-orthogonal localized basis set. This efficient inverting method can be incorporated in several O(N) methods for diagonalization of a gener...
متن کاملPrimitive Recursion and State Machines
Methods for specifying Moore type state machines (transducers) abstractly via primitive recursive functions and for definining parallel composition via simultaneous primitive recursion are discussed. The method is mostly of interest as a concise and convenient way of working with the complex state systems found in computer programming and engineering, but a short section indicates connections t...
متن کاملCelestial Mechanics Problem Set 2: The State Transition Matrix and Method of Differential Corrections
In this set of notes the State Transition Matrix for the N -body problem is developed. This matrix is the derivative of the flow generated by the N -body vector field with respect to initial conditions. It, and it’s inverse can be used in concert with the Newton Method in order to find/design orbits which begin at specified states and end in some specific configuration, such as a periodic orbit...
متن کاملRecursion removal in fast matrix multiplication
Recursion’s removal improves the efficiency of recursive algorithms, especially algorithms with large formal parameters, such as fast matrix multiplication algorithms. In this article, a general method of breaking recursions in fast matrix multiplication algorithms is introduced, which is generalized from recursions removal of a specific fast matrix multiplication algorithm of Winograd.
متن کاملA Matrix Dynamics Approach to Golomb's Recursion
In an unpublished note Golomb proposed a family of “strange” recursions of metafibonacci type, parametrized by k. Previously we showed that contrary to Golomb’s conjecture, for each k there are many increasing solutions, and an explicit construction for multiple solutions was displayed. By reformulating our solution approach using matrix dynamics, we extend these results to a characterization o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.01.022